BGP-Based Clustering for Scalable and Reliable Gossip Broadcast
نویسندگان
چکیده
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only have “local knowledge” about each other. They organize themselves dynamically (right from the bootstrapping phase), according to join, leave or crash events, to form a locality-based dissemination graph. Broadcast messages can be disseminated using these graphs in large networks like the Internet, without relying on any special infrastructure or intermediate brokers. Roughly speaking, a dissemination graph consists of “non-crossing” (independent) trees that provide multiple paths between processes for improved broadcast efficiency and reliability. Each tree is constructed using BGP routing information about process “locality”. We convey the feasibility of the algorithm using both simulation and experimental results and describe an application of our algorithm for broadcasting information streams.
منابع مشابه
Reliable Gossip-Based Broadcast Protocol in Mobile Ad Hoc Networks
Based on existing reliable broadcast protocols in MANETs, we propose a novel reliable broadcast protocol that uses clustering technique and gossip methodology. We combine local retransmission and gossip mechanisms to provide reliability in MANETs. The proposed protocol can dynamically change system parameters for reliable broadcast communication in order to improve the adaptability in the rapid...
متن کاملGossip-Based Broadcast
Gossip, or epidemic, protocols have emerged as a powerful strategy to implement highly scalable and resilient reliable broadcast primitives on large scale peer-to-peer networks. Epidemic protocols are scalable because they distribute the load among all nodes in the system and resilient because they have an intrinsic level of redundancy that masks node and network failures. This chapter provides...
متن کاملProbabilistic Multicast
Gossip-based broadcast algorithms have been considered as a viable alternative to traditional deterministic reliable broadcast algorithms in large scale environments. However, these algorithms focus on broadcasting events inside a large group of processes, while the multicasting of events to a subset of processes in a group only, potentially varying for every event, has not been considered. We ...
متن کاملGenius: Peer-to-Peer Location-Aware Gossip Using Network Coordinates
The gossip mechanism could support reliable and scalable communication in large-scale settings. In large-scale peer-to-peer environment, however, each node could only have partial knowledge of the group membership. More seriously, because the node has no global knowledge about the underlying topology, gossip mechanism incurs much unnecessary network overhead on the Internet. In this paper, we p...
متن کاملGGRA: a grouped gossip-based reputation aggregation algorithm
An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...
متن کامل